Completeness for a First-order Abstract Separation Logic

Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of program verification, or on concrete models for which completeness is not possible. An important element in concrete SL is the points-to predicate which denotes a singleton heap. SL with the points-to predicate has been shown to be non-recursively enumerable. In this paper, we develop a first-order SL, called FOASL, with an abstracted version of the points-to predicate. We prove that FOASL is sound and complete with respect to an abstract semantics, of which the standard SL semantics is an instance. We also show that some reasoning principles involving the points-to predicate can be approximated as FOASL theories, thus allowing our logic to be used for reasoning about concrete program verification problems. We give some example theories that are sound with respect to different variants of separation logics from the literature, including those that are incompatible with Reynolds's semantics. In the experiment we demonstrate our FOASL based theorem prover which is able to handle a large fragment of separation logic with heap semantics as well as non-standard semantics.Comment: This is an extended version of the APLAS 2016 paper with the same titl

LAPORAN MAGANG PROSES PRODUKSI, PENGENDALIAN MUTU DAN SANITASI DI PERUSAHAAN JAMU SABDO PALON DESA GATAK REJO KECAMATAN NGUTER KABUPATEN SUKOHARJO

Every company is expected to yields product that is with quality and safe consumed by public. For the purpose is required production process start from raw material handling up to handling of end product so that can yield product matching with SNI standard. Activity of this apprentice applied to add student knowledge in industrial world in general and to know more detailed about quality control in PJ. Sabdo Palon, Nguter, Sukoharjo. Activity of this apprentice executed on 3 Mey - 29 Mey 2010 di PJ. Sabdo Palon, Nguter, Sukoharjo. Data collecting method in this apprentice was executed with interview, observation, book study and downwards direct to field to do observation and joins in activity taking place in factory. Jamu is a product of natural ingredients from Indonesia, which is used for health maintenance, disease prevention, disease treatment, health recovery, fitness, and beauty. Jamu processing in factory can be divided into two, Jamu powders and Jamu pill. In PJ. Sabdo Palon, Nguter, Sukoharjo, Jamu powder processing begins with the compounding process and then followed a brief drying, milling, sieving, mixing, and packaging. For Jamu pill, after the Jamu powder finished, continued with mixing process and then compaction, pills molding, sorting pills, coating I, ovenizing, coating II and packaging. Quality control applied in the PJ. Sabdo Palon, starting from raw material acceptance until finished material packaging. Supervision of sanitation in the PJ. Palon Sabdo include materials sanitation, space and equipment sanitation, workers sanitation and waste handling. Production process waste include solid waste, wastewater, and other contaminated waste (eg dust). Kata Kunci : Production Processing, Jam

Looking at Separation Algebras with Boolean BI-eyes

Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceIn this paper, we show that the formulæ of Boolean BI cannot distinguish between some of the different notions of separation algebra found in the literature: partial commutative monoids, either cancellative or not, with a single unit or not, all define the same notion of validity. We obtain this result by the careful study of the specific properties of the counter-models that are generated by tableaux proof-search in Boolean B

Relating Labelled and Label-Free Bunched Calculi in BI Logic

International audienceIn this paper we study proof translations between labelled and label-free calculi for the logic of Bunched Implications (BI). We first consider the bunched sequent calculus LBI and define a labelled sequent calculus, called GBI, in which labels and constraints reflect the properties of a specifically tailored Kripke resource semantics of BI with two total resource composition operators and explicit internalization of inconsistency. After showing the soundness of GBI w.r.t. our specific Kripke frames, we show how to translate any LBI-proof into a GBI-proof. Building on the properties of that translation we devise a tree property that every LBI-translated GBI-proof enjoys. We finally show that any GBI-proof enjoying this tree property (and not only LBI-translated ones) can systematically be translated to an LBI-proof